package mincostmaxflow;

import java.util.Vector;

public class Route<T extends Edge> extends Vector<Edge>{

    public Route(){
        super();
    }

    public Route(Route<T> e){
        super(e);
    }

    public Route(Vector<T> e){
	super(e);
    }

    public Edge findEdge(Edge to_find){
        for(Edge e : this){
            if(e.equals(to_find))
                return e;
        }
        return null;
    }

}